Symbolic Model Order Reduction
نویسندگان
چکیده
Symbolic Model Order Reduction (SMOR) is the problem of reducing a large circuit that contains symbolic circuit parameters to smaller low order models at its ports. Several methods, including symbol isolation, single frequency point reduction, and multiple frequency point reduction, are described and compared. Test circuits with simulation results are presented to demonstrate the accuracy and efficiency of SMOR. II. Review on PRIMA Let us first examine the PRIMA algorithm briefly. Consider a SISO system that can be described by the following equation:
منابع مشابه
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration for model checking concurrent software. Our technique hinges on a new characterization of partial orders defined by computations of a concurrent program in terms of quasi-monotonic sequences of thread-ids. This characterizatio...
متن کاملSymbolic Model Checking of Software
In hardware verification, the introduction of symbolic model checking has been considered a breakthrough, allowing to verify systems clearly out-of-reach of any explicit-state model checker. In contrast, in the verification of concurrent software, model checking is still predominantly performed by explicitstate model checkers such as SPIN. These methods gain much of their efficiency from state-...
متن کاملMilestones: A Model Checker Combining Symbolic Model Checking and Partial Order Reduction
Symbolic techniques and partial order reduction (POR) are two fruitful approaches to deal with the combinatorial explosion of model checking. Unfortunately, past experience has shown that symbolic techniques do not work well for loosely-synchronized models, whereas, by applying POR methods, explicit-state model checkers are able to deal with large concurrent models. This paper presents the Mile...
متن کاملSymbolic Model Checking for Asynchronous Boolean Programs
Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among threads. Most modern software model checkers can handle only one source of non-determinism efficiently, but not both. This paper describes a SAT-based model checker for asynchronous Boolean programs that handles both sources effec...
متن کاملPeephole Partial Order Reduction
We present a symbolic dynamic partial order reduction (POR) method for model checking concurrent software. We introduce the notion of guarded independent transitions, i.e., transitions that can be considered as independent in certain (but not necessarily all) execution paths. These can be exploited by using a new peephole reduction method. A symbolic formulation of the proposed peephole reducti...
متن کامل